Domain Decomposition vs. Concurrent Multigrid Domain Decomposition vs. Concurrent Multigrid 1
نویسندگان
چکیده
We compare the performance on a concurrent computer of two domaindecomposition methods and a full-multigrid method for solving the Poisson equation on a square. Independent of the granularity of the computation, domain decomposition is almost always signi cantly slower than multigrid. Our largest computations use a multicomputer with 128 nodes to solve a problem on a 2048 2048 grid. In these computations, multigrid outperforms domain decomposition by at least four orders of magnitude.
منابع مشابه
A Short Note Comparing Multigrid and Domain Decomposition for Protein Modeling Equations
We consider multigrid and domain decomposition methods for the numerical solution of electrostatics problems arising in biophysics. We compare multigrid methods designed for discontinuous coefficients with domain decomposition methods, including comparisons of standard multigrid methods, algebraic multigrid methods, additive and multiplicative Schwarz domain decomposition methods, and accelerat...
متن کاملMultigrid and Domain Decomposition Methods for Electrostatics Problems
We consider multigrid and domain decomposition methods for the numerical solution of electrostatics problems arising in biophysics. We compare multigrid methods designed for discontinuous coefficients with domain decomposition methods, including comparisons of standard multigrid methods, algebraic multigrid methods, additive and multiplicative Schwarz domain decomposition methods, and accelerat...
متن کاملA Balancing Domain Decomposition Method for Magnetostatic Problems with a Multigrid Strategy
A balancing domain decomposition (BDD) method is considered as a preconditioner of the iterative domain decomposition method (DDM) for magnetostatic problems. The BDD method enables us to keep convergence properties of the iterative DDM even if the number of subdomains increases. However, in case of magnetostatic problems, the dimension of the coarse problem required in the BDD procedure depend...
متن کاملCoarse Spaces over the Ages
The objective of this paper is to explain the principles of the design of a coarse space in a simplified way and by pictures. The focus is on ideas rather than on a more historically complete presentation. That can be found, e.g., in [ 28]. Also, space limitation does not allow us even to mention many important methods and papers that should be rightfully included. The coarse space facilitates ...
متن کاملDomain Decomposition vs
Domain Decomposition (DD) techniques are not only the basic tools for data partitioning but also methods for constructing new parallel pde solvers. Domain Decomposition, mesh adaption and load balance seem to be in contradiction to the eecient use of massively parallel computers with serveral hundered, or even several thousand powerful, distributed memory processors. In the case of plane bounda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994